/**
 * MINAPL Compiler.
 * Copyright 2012 Michael A. Muller
 *
 * Permission is hereby granted, free of charge, to any person obtaining a
 * copy of this software and associated documentation files (the "Software"),
 * to deal in the Software without restriction, including without limitation
 * the rights to use, copy, modify, merge, publish, distribute, sublicense,
 * and/or sell copies of the Software, and to permit persons to whom the
 * Software is furnished to do so, subject to the following conditions:
 *
 * The above copyright notice and this permission notice shall be included in
 * all copies or substantial portions of the Software.
 *
 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
 * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
 * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
 * DEALINGS IN THE SOFTWARE.
 */

#ifndef _minapl_Array_h_
#define _minapl_Array_h_

namespace minapl {

/**
 * Managed array template.
 */
template <typename T>
struct Array {
    T *data;
    size_t size, cap;
    Array(size_t cap) : data(new T[cap]), size(0), cap(cap) {}
    ~Array() { delete [] data; }
    T operator [](int index) { return data[index]; }

    void add(T val) {
        if (size == cap) {
            T *newData = new T[cap *= 2];
            for (int i = 0; i < size; ++i)
                newData[i] = data[i];
            delete [] data;
            data = newData;
        }
        data[size++] = val;
    }

private:
    Array(const Array &other);
};


} // namespace minapl

#endif
